r-cross t-intersecting families for vector spaces
نویسندگان
چکیده
Let V be an n-dimensional vector space over the finite field Fq, and [Vk] denote family of all k-dimensional subspaces V. The families F1⊆[Vk1],F2⊆[Vk2],…,Fr⊆[Vkr] are said to r-cross t-intersecting if dim(F1∩F2∩⋯∩Fr)≥t for Fi∈Fi,1≤i≤r. F1, F2,…,Fr non-trivial dim(∩1≤i≤r∩F∈FiF)<t. In this paper, we first determine structure with maximum product their sizes. As a consequence, partially prove one Frankl Tokushige's conjectures about 1-intersecting spaces. Then describe sizes under assumptions r=2 F1=F2=⋯=Fr=F, respectively, where F in latter assumption is well known as r-wise family. Meanwhile, stability results also been proved.
منابع مشابه
On r-Cross Intersecting Families of Sets
Let (r−1)n ≥ rk and let F1, . . . ,Fr ⊂ ([n] k ) . Suppose that F1∩ ·· ·∩Fr 6= / 0 holds for all Fi ∈ Fi, 1≤ i≤ r. Then we show that ∏i=1 |Fi| ≤ (n−1 k−1 )r .
متن کاملOn cross t-intersecting families of sets
For all p, t with 0 < p < 0.11 and 1≤ t ≤ 1/(2p), there exists n0 such that for all n,k with n > n0 and k/n = p the following holds: if A and B are k-uniform families on n vertices, and |A∩B| ≥ t holds for all A ∈A and B ∈B, then |A ||B| ≤ (n−t k−t )2 .
متن کاملAn Erdős-Ko-Rado theorem for cross t-intersecting families
Article history: Received 28 January 2013 Available online 27 September 2014
متن کاملTHE EIGENVALUE METHOD FOR CROSS t-INTERSECTING FAMILIES
We show that the Erdős–Ko–Rado inequality for t-intersecting families of subsets can be easily extended to an inequality for cross t-intersecting families by using the eigenvalue method. The same applies to the case of t-intersecting families of subspaces. The eigenvalue method is one of the proof techniques to get Erdős–Ko–Rado type inequalities for t-intersecting families, for example, a proo...
متن کاملUniformly cross intersecting families
Let A and B denote two families of subsets of an n-element set. The pair (A,B) is said to be `-cross-intersecting iff |A∩B| = ` for all A ∈ A and B ∈ B. Denote by P`(n) the maximum value of |A||B| over all such pairs. The best known upper bound on P`(n) is Θ(2), by Frankl and Rödl. For a lower bound, Ahlswede, Cai and Zhang showed, for all n ≥ 2`, a simple construction of an `-cross-intersectin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2023
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2022.105688